Predicate Gradual Logic and Linguistics
نویسنده
چکیده
There are several major proposals for treating donkey anaphora such as discourse representation theory and the likes, or E-Type theories and the likes. Every one of them works well for a set of specific examples that they use to demonstrate validity of their approaches. As I show in this paper, however, they are not very generalisable and do not account for essentially the same problem that they remedy when it manifests in other examples. I propose another logical approach. I develop logic that extends a recent, propositional gradual logic, and show that it can treat donkey anaphora generally. I also identify and address a problem around the modern convention on existential import. Furthermore, I show that Aristotle’s syllogisms and conversion are realisable in predicate gradual logic.
منابع مشابه
First-order logic - Wikipedia, the free encyclopedia
First-order logic (FOL) is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus, the language of first-order logic or predicate logic. Unlike natural languages such as English, FOL uses a wholly unambiguous formal language interpreted by mathematical str...
متن کاملPredicate logic with flexibly binding operators and natural language semantics
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including ‘donkey sentences’ and crosssentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predi...
متن کاملGothenburg Monographs in Linguistics 13 on the Semantics of Propositional Attitude Reports
This is a study on the truth-conditional semantics of propositional attitude attribution statements. It is suggested that attitude contents should be characterized in terms of abstract concepts, which are connected by way of a number of basic logical relations derived from a version of Quinean predicate-functor logic. This allows us to handle all logical relationships definable by first-order p...
متن کاملPredicate Logic with Anaphora
In this paper I make a case for a separate treatment of (singular) anaphoric pronouns within a predicate logic with anaphora (PLA). Discourse representation theoretic results (from Kamp 1981) can be formulated in a compositional way, without d-dling with orthodox notions of scope and binding. In contrast with its predecessor dynamic predicate logic (Groenendijk and Stokhof 1991), the system of ...
متن کاملPredicate Logic Processor of Spatially Patterned Signals
A processor is proposed for spatially modulated or patterned signals. Two voltage impulses are transmitted along the coupled wires and they are considered as a predicate expression. The developed gates and processor perform the predicate logical operations AND, NOT and OR with these expressions. The designed processor is applicable to the artificial intelligence area especially it will be usefu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.05570 شماره
صفحات -
تاریخ انتشار 2016